Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion Probability

نویسندگان

  • Shota Saito
  • Toshiyasu Matsushima
چکیده

This paper considers the problem of variable-length lossy source coding. The performance criteria are the excess distortion probability and the cumulant generating function of codeword lengths. We derive a non-asymptotic fundamental limit of the cumulant generating function of codeword lengths allowing positive excess distortion probability. It is shown that the achievability and converse bounds are characterized by the Rényi entropy-based quantity. In the proof of the achievability result, the explicit code construction is provided. Further, we investigate an asymptotic single-letter characterization of the fundamental limit for a stationary memoryless source.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability

We consider the variable-to-fixed length lossy source coding (VFSC) problem. The optimal compression rate of the average length of variable-to-fixed source coding, allowing a non-vanishing probability of excess-distortion ε, is shown to be equal to (1−ε)R(D), where R(D) is the rate-distortion function of the source. In comparison to the related results of Koga and Yamamoto as well as Kostina, P...

متن کامل

Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures

This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly identifying the unknown object and, similarly to Arikan’s bounds, they are expressed in terms of the Arimoto-Rényi conditional entropy. Although Arikan’s bounds ar...

متن کامل

Variable-length compression allowing errors (extended)

This paper studies the fundamental limits of the minimum average length of variable-length compression when a nonzero error probability ǫ is tolerated. We give non-asymptotic bounds on the minimum average length in terms of Erokhin’s rate-distortion function and we use those bounds to obtain a Gaussian approximation on the speed of approach to the limit which is quite accurate for all but small...

متن کامل

Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding

Lossy compression of a discrete memoryless source (DMS) with respect to a single-letter distortion measure is considered. We study the best attainable tradeoff between the exponential rates of the probabilities that the codeword length and that the cumulative distortion exceed respective thresholds for two main cases. The first scenario examined is that where the source is corrupted by a discre...

متن کامل

An Information-Theoretic Study on Variable-Length Source Coding with Unequal Cost

– Abstract – In the variable-length source coding, we may consider vary zestful problem as follows: If each code symbol is given prescribed cost to transmit or record, what code is optimal? This problem is substantial from not only theoretical viewpoints but also engineering points of view. Because, in practical systems of communication or recording , it may reasonable to consider unequal costs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1801.02496  شماره 

صفحات  -

تاریخ انتشار 2018